R2-Based Multi/Many-Objective Particle Swarm Optimization
نویسندگان
چکیده
منابع مشابه
R2-Based Multi/Many-Objective Particle Swarm Optimization
We propose to couple the R2 performance measure and Particle Swarm Optimization in order to handle multi/many-objective problems. Our proposal shows that through a well-designed interaction process we could maintain the metaheuristic almost inalterable and through the R2 performance measure we did not use neither an external archive nor Pareto dominance to guide the search. The proposed approac...
متن کاملA Multi-Objective Hybrid Particle Swarm Optimization-based Service Identification
Service identification step is a basic requirement for a detailed design and implementation of services in a Service Oriented Architecture (SOA). Existing methods for service identification ignore the automation capability while providing human based prescriptive guidelines, which mostly are not applicable at enterprise scales. In this paper, we propose a top down approach to identify automatic...
متن کاملGPU-Based Parallel Multi-objective Particle Swarm Optimization
In the recent years, multi-objective particle swarm optimization (MOPSO) has become quite popular in the field of multi-objective optimization. However, due to a large amount of fitness evaluations as well as the task of archive maintaining, the running time of MOPSO for optimizing some difficult problems may be quite long. This paper proposes a parallel MOPSO based on consumer-level Graphics P...
متن کاملParticle swarm optimization for a bi-objective web-based convergent product networks
Here, a collection of base functions and sub-functions configure the nodes of a web-based (digital)network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network ...
متن کاملDynamic-objective particle swarm optimization for constrained optimization problems
This paper firstly presents a novel constraint-handling technique , called dynamicobjective method (DOM), based on the search mechanism of the particles of particle swarm optimization (PSO). DOM converts the constrained optimization problem into a bi-objective optimization problem, and then enables each particle to dynamically adjust its objectives according to its current position in the searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence and Neuroscience
سال: 2016
ISSN: 1687-5265,1687-5273
DOI: 10.1155/2016/1898527